Equally-distant partially-entangled alphabet states for quantum channels

Each Bell state has the property that by performing just local operations on one qubit, the complete Bell basis can be generated. That is, states generated by local operations are totally distinguishable. This remarkable property is due to maximal quantum entanglement between the two particles. We present a set of local unitary transformations that generate out of partially entangled two-qubit state a set of four maximally distinguishable states that are mutually equally distant. We discuss quantum dense coding based on these alphabet states.Comment: 7 revtex pages, 2 eps figures, to appear in Phys. Rev. A 62, 1 November (2000

Realization of a collective decoding of codeword states

This was also extended from the previous article quant-ph/9705043, especially in a realization of the decoding process.Comment: 6 pages, RevTeX, 4 figures(EPS

Noisy Preprocessing and the Distillation of Private States

We provide a simple security proof for prepare & measure quantum key distribution protocols employing noisy processing and one-way postprocessing of the key. This is achieved by showing that the security of such a protocol is equivalent to that of an associated key distribution protocol in which, instead of the usual maximally-entangled states, a more general {\em private state} is distilled. Besides a more general target state, the usual entanglement distillation tools are employed (in particular, Calderbank-Shor-Steane (CSS)-like codes), with the crucial difference that noisy processing allows some phase errors to be left uncorrected without compromising the privacy of the key.Comment: 4 pages, to appear in Physical Review Letters. Extensively rewritten, with a more detailed discussion of coherent --> iid reductio

Mixed quantum state detection with inconclusive results

We consider the problem of designing an optimal quantum detector with a fixed rate of inconclusive results that maximizes the probability of correct detection, when distinguishing between a collection of mixed quantum states. We develop a sufficient condition for the scaled inverse measurement to maximize the probability of correct detection for the case in which the rate of inconclusive results exceeds a certain threshold. Using this condition we derive the optimal measurement for linearly independent pure-state sets, and for mixed-state sets with a broad class of symmetries. Specifically, we consider geometrically uniform (GU) state sets and compound geometrically uniform (CGU) state sets with generators that satisfy a certain constraint. We then show that the optimal measurements corresponding to GU and CGU state sets with arbitrary generators are also GU and CGU respectively, with generators that can be computed very efficiently in polynomial time within any desired accuracy by solving a semidefinite programming problem.Comment: Submitted to Phys. Rev.

Quantum privacy and quantum coherence

We derive a simple relation between a quantum channel's capacity to convey coherent (quantum) information and its usefulness for quantum cryptography.Comment: 6 pages RevTex; two short comments added 7 October 199

Nonorthogonal Quantum States Maximize Classical Information Capacity

I demonstrate that, rather unexpectedly, there exist noisy quantum channels for which the optimal classical information transmission rate is achieved only by signaling alphabets consisting of nonorthogonal quantum states.Comment: 5 pages, REVTeX, mild extension of results, much improved presentation, to appear in Physical Review Letter

Compression of quantum measurement operations

We generalize recent work of Massar and Popescu dealing with the amount of classical data that is produced by a quantum measurement on a quantum state ensemble. In the previous work it was shown how spurious randomness generally contained in the outcomes can be eliminated without decreasing the amount of knowledge, to achieve an amount of data equal to the von Neumann entropy of the ensemble. Here we extend this result by giving a more refined description of what constitute equivalent measurements (that is measurements which provide the same knowledge about the quantum state) and also by considering incomplete measurements. In particular we show that one can always associate to a POVM with elements a_j, an equivalent POVM acting on many independent copies of the system which produces an amount of data asymptotically equal to the entropy defect of an ensemble canonically associated to the ensemble average state and the initial measurement (a_j). In the case where the measurement is not maximally refined this amount of data is strictly less than the von Neumann entropy, as obtained in the previous work. We also show that this is the best achievable, i.e. it is impossible to devise a measurement equivalent to the initial measurement (a_j) that produces less data. We discuss the interpretation of these results. In particular we show how they can be used to provide a precise and model independent measure of the amount of knowledge that is obtained about a quantum state by a quantum measurement. We also discuss in detail the relation between our results and Holevo's bound, at the same time providing a new proof of this fundamental inequality.Comment: RevTeX, 13 page

Distinguishability of States and von Neumann Entropy

Consider an ensemble of pure quantum states |\psi_j>, j=1,...,n taken with prior probabilities p_j respectively. We show that it is possible to increase all of the pairwise overlaps || i.e. make each constituent pair of the states more parallel (while keeping the prior probabilities the same), in such a way that the von Neumann entropy S is increased, and dually, make all pairs more orthogonal while decreasing S. We show that this phenomenon cannot occur for ensembles in two dimensions but that it is a feature of almost all ensembles of three states in three dimensions. It is known that the von Neumann entropy characterises the classical and quantum information capacities of the ensemble and we argue that information capacity in turn, is a manifestation of the distinguishability of the signal states. Hence our result shows that the notion of distinguishability within an ensemble is a global property that cannot be reduced to considering distinguishability of each constituent pair of states.Comment: 18 pages, Latex, 2 figure

A Full Characterization of Quantum Advice

We prove the following surprising result: given any quantum state rho on n qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of two-qubit interactions), such that any ground state of H can be used to simulate rho on all quantum circuits of fixed polynomial size. In terms of complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which supersedes the previous result of Aaronson that BQP/qpoly is contained in PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in power to untrusted quantum advice combined with trusted classical advice. Proving our main result requires combining a large number of previous tools -- including a result of Alon et al. on learning of real-valued concept classes, a result of Aaronson on the learnability of quantum states, and a result of Aharonov and Regev on "QMA+ super-verifiers" -- and also creating some new ones. The main new tool is a so-called majority-certificates lemma, which is closely related to boosting in machine learning, and which seems likely to find independent applications. In its simplest version, this lemma says the following. Given any set S of Boolean functions on n variables, any function f in S can be expressed as the pointwise majority of m=O(n) functions f1,...,fm in S, such that each fi is the unique function in S compatible with O(log|S|) input/output constraints.Comment: We fixed two significant issues: 1. The definition of YQP machines needed to be changed to preserve our results. The revised definition is more natural and has the same intuitive interpretation. 2. We needed properties of Local Hamiltonian reductions going beyond those proved in previous works (whose results we'd misstated). We now prove the needed properties. See p. 6 for more on both point

Fidelity and the communication of quantum information

We compare and contrast the error probability and fidelity as measures of the quality of the receiver's measurement strategy for a quantum communications system. The error probability is a measure of the ability to retrieve classical information and the fidelity measures the retrieval of quantum information. We present the optimal measurement strategies for maximizing the fidelity given a source that encodes information on the symmetric qubit-states